A Tabular Interpretation of Bottom - up Automata for TAGEric
نویسندگان
چکیده
We present a tabular interpretation for a class of 2{Stack Automata that may be used to describe bottom-up parsing strategies for TAGs. The results are also useful for tabulating other existing bottom-up automata models for this kind of languages.
منابع مشابه
A tabular interpretation of bottom-up automata for TAG
We present a tabular interpretation for a class of 2–Stack Automata that may be used to describe bottom-up parsing strategies for TAGs. The results are also useful for tabulating other existing bottomup automata models for this kind of languages.
متن کاملA Tabular Interpretation of a Class of 2-stack Automata
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to purely bottom-up, for LIGs and TAGs. The tabular interpretation ensures, for all strategies, a time complexity in O(n 6) and space complexity in O(n 5) where n is the length of the input string.
متن کاملA tabular interpretation of a class of 2 - Stack AutomataEric
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to purely bottom-up, for LIGs and TAGs. The tabular interpretation ensures, for all strategies, a time complexity in O(n 6) and space complexity in O(n 5) where n is the length of the input string.
متن کاملA Tabular Interpretation of a Class of 2-Stack Automata
I n t r o d u c t i o n 2-Stack automata [2SA] haw~' been identified as possible operational devices to describe parsing strategies for Linear Indexed Grammars [LIG] or Tree Adjoining Grammars [TAG] (mirroring the traditional use of Push-Down Automata [PDA] for ContextFree Grammars [CFG]). Different variants of 2SA (or not so distant EInbedded Push-Down Automata) have been proposed, some to des...
متن کاملPractical aspects in compiling tabular TAG parsers
This paper describes the extension of the system DyALog to compile tabular parsers from Feature Tree Adjoining Grammars. The compilation process uses intermediary 2-stack automata to encode various parsing strategies and a dynamic programming interpretation to break automata derivations into tabulable fragments.
متن کامل